Colored Subspace Analysis

نویسندگان

  • Fabian J. Theis
  • Motoaki Kawanabe
چکیده

With the advent of high-throughput data recording methods in biology and medicine, the efficient identification of meaningful subspaces within these data sets becomes an increasingly important challenge. Classical dimension reduction techniques such as principal component analysis often do not take the large statistics of the data set into account, and thereby fail if the signal space is for example of low power but meaningful in terms of some other statistics. With ‘colored subspace analysis’, we propose a method for linear dimension reduction that evaluates the time structure of the multivariate observations. We differentiate the signal subspace from noise by searching for a subspace of non-trivially autocorrelated data; algorithmically we perform this search by joint lowrank approximation. In contrast to blind source separation approaches we however do not require the existence of sources, so the model is applicable to any wide-sense stationary time series without restrictions. Moreover, since the method is based on second-order time structure, it can be efficiently implemented even for large dimensions. We conclude with an application to dimension reduction of functional MRI recordings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robustness of the subspace GLRT to signal mismatch

The robustness of a subspace generalized likelihood ratio test (GLRT) detector to signal mismatch is addressed for data conforming to the generalized multivariate analysis of variance model. This model assumes a deterministic signal of known form in the presence of unknown, colored, Gaussian noise. The subspace GLRT compresses data into a lower-dimensional subspace prior to detection. It is sho...

متن کامل

Edge Colored Hypergraphic Arrangements

A subspace arrangement defined by intersections of hyperplanes of the braid arrangement can be encoded by an edge colored hypergraph. It turns out that the characteristic polynomial of this type of subspace arrangement is given by a generalized chromatic polynomial of the associated edge colored hypergraph. The main result of this paper supplies a sufficient condition for the existence of non-t...

متن کامل

A Signal Subspace Speech Enhancement Method for Various Noises

In this paper, we propose a single-channel speech enhancement method in terms of subspace techniques to reduce the noises from speech signals in various noises environment. This subspace approach based on Karhunen-Loève transform and implemented via Principal component analysis. The optimal subspace selection is provided by a minimum description length criterion. An offset factor generated from...

متن کامل

A generalized subspace approach for enhancing speech corrupted by colored noise

A generalized subspace approach is proposed for enhancement of speech corrupted by colored noise. A nonunitary transform, based on the simultaneous diagonalization of the clean speech and noise covariance matrices, is used to project the noisy signal onto a signal-plus-noise subspace and a noise subspace. The clean signal is estimated by nulling the signal components in the noise subspace and r...

متن کامل

Extension of the local subspace method to enhancement of speech with colored noise

Based on dynamic features of human speech, the local projection (LP) method has been adapted to the enhancement of speech corrupted by white noise. As an extension of the LP method, a strategy with two rounds of projection is introduced to enhance the speech contaminated with colored noise. Colored noise mainly resides in a low dimensional subspace, and is assumed to be stationary in this commu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007